Generating Benders cuts for a general class of integer programming problemsYINGYI CHU; QUANSHI XIA.Lecture notes in computer science. 2004, pp 127-141, issn 0302-9743, isbn 3-540-21836-X, 15 p.Conference Paper

New tractable classes from oldCOHEN, David; JEAVONS, Peter; GAULT, Richard et al.Lecture notes in computer science. 2000, pp 160-171, issn 0302-9743, isbn 3-540-41053-8Conference Paper

Refinements and independence : A simple method for identifying tractable disjunctive constraintsBROXVALL, Mathias; JONSSON, Peter; RENZ, Jochen et al.Lecture notes in computer science. 2000, pp 114-127, issn 0302-9743, isbn 3-540-41053-8Conference Paper

A new abstract logic programming language and its quantifier elimination method for disjunctive logic programmingSTEPHAN, I.Lecture notes in computer science. 1998, pp 403-416, issn 0302-9743, isbn 3-540-64993-XConference Paper

Teaching classes with high teaching dimension using few examplesBALBACH, Frank J.Lecture notes in computer science. 2005, pp 668-683, issn 0302-9743, isbn 3-540-26556-2, 16 p.Conference Paper

Pseudo-Boolean optimization with a disjunctive constraintDONSKOI, V. I.Computational mathematics and mathematical physics. 1994, Vol 34, Num 3, pp 389-398, issn 0965-5425Article

On the complexity of dualization of monotone disjunctive normal formsFREDMAN, M. L; KHACHIYAN, L.Journal of algorithms (Print). 1996, Vol 21, Num 3, pp 618-628, issn 0196-6774Article

The intractability of resolutionHAKEN, A.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 297-308, issn 0304-3975Article

Representation of logic formulas by normal formsDANKOVA, Martina.Kybernetika. 2002, Vol 38, Num 6, pp 717-728, issn 0023-5954, 12 p.Article

Normal forms for fuzzy logic functions and their approximation abilityPERFILIEVA, Irina.Fuzzy sets and systems. 2001, Vol 124, Num 3, pp 371-384, issn 0165-0114Article

Applying preference biases to conjunctive and disjunctive version spacesSMIRNOV, E. N; VAN DEN HERIK, H. J.Lecture notes in computer science. 2000, pp 321-330, issn 0302-9743, isbn 3-540-41044-9Conference Paper

Some estimates of the complexity of disjunctive normal forms of a random boolean functionTOMAN, E; TOMANOVA, J.Computers and artificial intelligence. 1991, Vol 10, Num 4, pp 327-340, issn 0232-0274Article

ALGORITHMES LOCAUX SUR LES FORMES NORMALES DISJONCTIVESZHURAVLEV YU I.1979; DOKL. AKAD. NAUK S.S.S.R.; SUN; DA. 1979; VOL. 245; NO 2; PP. 289-292; BIBL. 9 REF.Article

ALGORITHME LOCAL D'INDICE 1 POUR LA CONSTRUCTION D'UNE SOMME DE FORMES NORMALES DISJONCTIVES A IMPASSES POUR LES FONCTIONS DE LA LOGIQUE K-VALENTENURLYBAEV AN.1977; ZH. VYCHISLIT. MAT. MAT. FIZ.; S.S.S.R.; DA. 1977; VOL. 17; NO 6; PP. 1556-1563; BIBL. 4 REF.Article

INFLUENCE DE LA DEPENDANCE FONCTIONNELLE DES ENSEMBLES DE CODES DANS L'OPTIMISATION DE LA STRUCTURE LOGIQUE A DEUX NIVEAUX D'UN AUTOMATELEMBERSKIJ IG.1980; AVTOMAT. VYCHISLIT. TEKH.; SUN; DA. 1980; NO 4; PP. 42-49; BIBL. 1 REF.Article

LES DIFFERENTES NOTIONS DE MINIMALITE DES FORMES NORMALES DISJONCTIVESVEBER K.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 36; PP. 129-158; BIBL. 10 REF.Article

SYNTHESE DE LA STRUCTURE LOGIQUE D'UN AUTOMATE FINI DANS LA CLASSE DES FORMES NORMALES DISJONCTIVESLANGE EH EH; FRITSNOVICH GF.1982; AVTOM. VYCISL. TEH.; ISSN 504858; SUN; DA. 1982; NO 3; PP. 43-50; BIBL. 18 REF.Article

RELATIONS BINAIRES COORDONNEES DANS L'ESPACE DES CRITERES. IIVINOGRADSKAYA TM; RUBCHINSKIJ AA.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 4; PP. 147-155; ABS. ENG; BIBL. 3 REF.Article

ON THE COMPLEXITY OF REGULAR RESOLUTION AND THE DAVIS-PUTNAM PROCEDURE.GALIL Z.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 1; PP. 23-46; BIBL. 14 REF.Article

A reactive local search-based algorithm for the disjunctively constrained knapsack problemHIFI, M; MICHRAFY, M.The Journal of the Operational Research Society. 2006, Vol 57, Num 6, pp 718-726, issn 0160-5682, 9 p.Article

Learning DNFs and circuits using teaching assistantsVARIYAM VINODCHANDRAN, N.Lecture notes in computer science. 2004, pp 188-197, issn 0302-9743, isbn 3-540-22856-X, 10 p.Conference Paper

Extracting minimal and closed monotone DNF formulasSHIMA, Yoshikazu; MITSUISHI, Shinji; HIRATA, Kouichi et al.Lecture notes in computer science. 2004, pp 298-305, issn 0302-9743, isbn 3-540-23357-1, 8 p.Conference Paper

Extraction of coverings as monotone DNF formulasHIRATA, Kouichi; NAGAZUMI, Ryosuke; HARAO, Masateru et al.Lecture notes in computer science. 2003, pp 166-179, issn 0302-9743, isbn 3-540-20293-5, 14 p.Conference Paper

What is the expressive power of disjunctive preconditions?NEBEL, B.Lecture notes in computer science. 2000, pp 294-307, issn 0302-9743, isbn 3-540-67866-2Conference Paper

Conditional modeling. 2. Solving using complementarity and boundary-crossing formulationsRICO-RAMIREZ, V; WESTERBERG, A. W.Industrial & engineering chemistry research. 1999, Vol 38, Num 2, pp 531-553, issn 0888-5885Article